Hardware architectures for algebra, cryptology, and number theory

نویسندگان

  • Kris Gaj
  • Rainer Steinwandt
چکیده

Over the past few years, the interaction of research in computer engineering with research in algebra and number theory has intensified. This interaction is especially visible in cryptography and cryptanalysis, but covers also other areas, such as bioinformatics, coding theory, and image processing. This special issue attempts to explore this interaction, by highlighting recent advances in the development of efficient hardware architectures for algebra, cryptology, and number theory. The call for papers for this special issue listed several examples of topics of interest and resulted in a pool of 30 submissions, from which we selected the papers finally comprising this special issue. At the end of a comprehensive review and revision process stood five papers, resulting in an acceptance rate of less than 17%. Independent of the final outcome of the review process, we would like to express our appreciation to all submitting authors for their valuable contributions. For manuscripts that in the end could not be included, we hope that the reviewer feedback was perceived by the authors as constructive and helpful. Numerous external reviewers generously offered their expertise and time, and we greatly appreciate their invaluable help in the evaluation process. Below, we provide a quick bird’s-eye view of the research fields of interest to this issue, and show how the five selected papers fit in this view, and enhance and enrich what was accomplished so far. Modern cryptography is based on the use of two major classes of cryptosystems. Symmetric key ciphers, with a cryptographic key shared between sender and receiver, are used for bulk encryption of data at speeds reach-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SecChisel: Language and Tool for Practical and Scalable Security Verification of Security-Aware Hardware Architectures

Due to lack of practical and scalable security verification tools and methodologies, very few of the existing hardware-software security architectures have been thoroughly checked at the design time. To address this issue, our project develops a security verification methodology that is applicable to different hardware-software security architectures during the design phase. The verification fr...

متن کامل

Reducing Hardware Complexity of Wallace Multiplier Using High Order Compressors Based on CNTFET

   Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...

متن کامل

High-speed Hardware Implementations of Point Multiplication for Binary Edwards and Generalized Hessian Curves

Abstract— In this paper high-speed hardware architectures of point multiplication based on Montgomery ladder algorithm for binary Edwards and generalized Hessian curves in Gaussian normal basis are presented. Computations of the point addition and point doubling in the proposed architecture are concurrently performed by pipelined digitserial finite field multipliers. The multipliers in parallel...

متن کامل

Multiplication of sparse Laurent polynomials and Poisson series on modern hardware architectures

In this paper we present two algorithms for the multiplication of sparse Laurent polynomials and Poisson series (the latter being algebraic structures commonly arising in Celestial Mechanics from the application of perturbation theories). Both algorithms first employ the Kronecker substitution technique to reduce multivariate multiplication to univariate multiplication, and then use the schoolb...

متن کامل

A Family of Scalable Polynomial Multiplier Architectures for Ring-LWE Based Cryptosystems

Many lattice based cryptosystems are based on the Ring learning with errors (Ring-LWE) problem. The most critical and computationally intensive operation of these Ring-LWE based cryptosystems is polynomial multiplication over rings. In this paper, we exploit the number theoretic transform (NTT) to build a family of scalable polynomial multiplier architectures, which provide designers with a tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Integration

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2011